A Joining Shortest Queue with MAP Inputs
نویسندگان
چکیده
In this paper we study a MAP/M/K system with join-the-shortest-queue (JSQ) discipline which consists of K servers and K queues with infinite buffers. An arrival joins the shortest queue and in the case that there are n (n≤ K) queues having the same shortest length, the customer will join any one of these shortest queues with probability 1/n. We model the system as a levelexpanding QBD (LDQBD) process with expanding-block-structured generator matrix by defining the sum of the multi-queue lengths as the level. This method enable us to quantify the regular queueing measures, including stationary joint queue length distribution and sojourn time distribution. We also compare the effect of JSQ and randomly-join-queue.
منابع مشابه
Allocating Soft Real-Time Tasks on Cluster
We consider distributing soft real-time tasks on a cluster of multiple homogeneous servers. The question considered here is how to assign incoming soft real-time tasks to these servers for better performance, measured by the fraction of tasks that miss their deadlines. In this paper, two architectures are taken into account-centralized and distributed. Within the distributed architecture , four...
متن کاملAsymptotic behavior for MAP/PH/c queue with shortest queue discipline and jockeying
This paper considers a parallel queueing model with heterogeneous servers, where an arriving customer joins the shortest queue and jockeying between queues is permitted. Based on the matrix analytic approach pioneered by Neuts, we obtain the tail decay rate of the stationary distribution for this queueing model.
متن کاملA tandem network with MAP inputs
This paper studies a tandem queue with MAP inputs. A novel formulation is proposed to model it into a level-dependent quasi-birth-death process with expanding blocks. This allows us to analyze the joint time-dependent and steady-state queue length distributions efficiently. We also obtain the network sojourn time of an arbitrary customer.
متن کاملEquilibrium in Queues Under Unknown Service Times and Service Value
In the Operations Research queue-joining literature, beginning with Naor (1969), the queue joining probability is monotonic decreasing in the queue length; the longer the queue, the fewer consumers join. Recent academic and empirical evidence indicates that queue-joining probabilities may not always be decreasing in the queue length. We provide a simple explanation for these non-monotonic queue...
متن کاملAnalyzing a Bloom Filter Algorithm via a join-the-shortest-queue queuing system
This paper deals with the problem of identifying elephants in the Internet Traffic. The aim is to analyze a new adaptive algorithm based on a Bloom Filter. This algorithm uses a so-called min-rule which can be described as in the supermarket model. This model consists of joining the shortest queue among d queues selected at random in a large number of m queues. In case of equality, one of the s...
متن کامل